A simple approach towards the sign problem using path optimisation
نویسندگان
چکیده
منابع مشابه
Solving a unique Shortest Path problem using Ant Colony Optimisation
Ant Colony Optimisation (ACO) has in the past proved suitable to solve many optimisation problems. This research explores the ability of the ACO algorithm to balance two quality metrics (length and cost) in its decision making process. Results are given for a preliminary investigation based on a series of shortest path problems. It is concluded that, for these problems at least, the solution qu...
متن کاملSimple alternating path problem
Let A be a set of 2n points in general position on a plane, and suppose n of the points are coloured red while the remaining are coloured blue. An alternating path P of A is a sequence p1, p2,..., p2n of points of A such that p2i is blue and p2i+1 is red. P is simple if it does not intersect itself. We determine the condition under which there exists a simple alternating path P of A for the cas...
متن کاملReduction of the sign problem using the meron-cluster approach.
The sign problem in quantum Monte Carlo calculations is analyzed using the meron-cluster solution. A meron is a loop that alters the sign of the configuration, and the concept of merons can be used to solve the sign problem for a limited class of models. Here we show that the method can be used to reduce the sign problem in a wider class of models. We investigate how the meron solution evolves ...
متن کاملFinding the Critical Path - A Simple Approach
Figuring out why a process in a batch window ended late often requires tracing back through the critical path to look for anomalies. In a complicated batch schedule, determining which jobs are on the critical path can be a seemingly daunting task. Various commercial products can be used for this task, but they may not be necessary. The code needed to determine which predecessor jobs constitute ...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2018
ISSN: 1029-8479
DOI: 10.1007/jhep12(2018)054